Minimal Primary Decomposition and Factorized Gröbner Bases

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Triangular Systems and Factorized Gröbner Bases

Solving systems of polynomial equations in an ultimate way means to nd the isolated primes of the associated variety and to present them in a way that is well suited for further computations. [5] proposes an algorithm, that uses several Grobner basis computations for a dimension reduction argument, delaying factorization to the end of the algorithm. In this paper we investigate the opposite ap...

متن کامل

Gröbner Bases and Primary Decomposition of Polynomial Ideals

We present an algorithm to compute the primary decomposition of any ideal in a polynomial ring over a factorially closed algorithmic principal ideal domain R. This means that the ring R is a constructive PID and that we are given an algorithm to factor polynomials over fields which are finitely generated over R or residue fields of R. We show how basic ideal theoretic operations can be performe...

متن کامل

Multiplicative Bases, Gröbner Bases, and Right Gröbner Bases

Before surveying the results of the paper, we introduce path algebras. Path algebras play a central role in the representation theory of finite-dimensional algebras (Gabriel, 1980; Auslander et al., 1995; Bardzell, 1997) and the theory of Gröbner bases (Bergman, 1978; Mora, 1986; Farkas et al., 1993) has been an important tool in some results (Feustel et al., 1993; Green and Huang, 1995; Bardze...

متن کامل

Minimal Gröbner bases and the predictable leading monomial property

We focus on Gröbner bases for modules of univariate polynomial vectors over a ring. We identify a useful property, the " predictable leading monomial (PLM) property " that is shared by minimal Gröbner bases of modules in F[x] q , no matter what positional term order is used. The PLM property is useful in a range of applications and can be seen as a strengthening of the wellknown predictable deg...

متن کامل

Speeding Up Cylindrical Algebraic Decomposition by Gröbner Bases

Gröbner Bases [Buc70] and Cylindrical Algebraic Decomposition [Col75,CMMXY09] are generally thought of as two, rather different, methods of looking at systems of equations and, in the case of Cylindrical Algebraic Decomposition, inequalities. However, even for a mixed system of equalities and inequalities, it is possible to apply Gröbner bases to the (conjoined) equalities before invoking CAD. ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Applicable Algebra in Engineering, Communication and Computing

سال: 1997

ISSN: 0938-1279,1432-0622

DOI: 10.1007/s002000050064